"graph toughness" meaning in All languages combined

See graph toughness on Wiktionary

Noun [English]

Head templates: {{en-noun|-}} graph toughness (uncountable)
  1. (mathematics) A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph. Wikipedia link: graph toughness Tags: uncountable Categories (topical): Combinatorics, Mathematics

Download JSON data for graph toughness meaning in All languages combined (1.6kB)

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "graph toughness (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with topic categories using raw markup",
          "parents": [
            "Entries with topic categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Combinatorics",
          "orig": "en:Combinatorics",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph."
      ],
      "id": "en-graph_toughness-en-noun-fx-kXVfa",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "complete graph",
          "complete graph"
        ],
        [
          "connectivity",
          "connectivity"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "graph toughness"
      ]
    }
  ],
  "word": "graph toughness"
}
{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "graph toughness (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with topic categories using raw markup",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Combinatorics",
        "en:Mathematics"
      ],
      "glosses": [
        "A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "complete graph",
          "complete graph"
        ],
        [
          "connectivity",
          "connectivity"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "graph toughness"
      ]
    }
  ],
  "word": "graph toughness"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-06-04 from the enwiktionary dump dated 2024-05-02 using wiktextract (e9e0a99 and db5a844). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.